Bare bones differential evolution

Turing Complete Catalytic Particle Computers

The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to construct Bare Bones programs by programming the state transitions of a multifunctional catalytic particle. Molecular counts represent program variables, and are altered by the action of the catalytic particle. Chemica...

Bare Bones Particle Swarms with Jumps

Bare Bones PSO was proposed by Kennedy as a model of PSO dynamics. Dependence on velocity is replaced by sampling from a Gaussian distribution. Although Kennedy’s original formulation is not competitive to standard PSO, the addition of a component-wise jumping mechanism, and a tuning of the standard deviation, can produce a comparable optimisation algorithm. This algorithm, Bare Bones with Jump...

A Bare-bones Constraint Grammar

This paper presents a solution for overcoming the lexical resource gap when mounting rule-based Constraint Grammar systems for minor languages, or in the face of licensing and financing limitations. We investigate how the performance of a CG disambiguation grammar responds to shifting input parameters, among them lexicon limitations of various degrees, the lack a morphological analyzer or both....

Multi swarm bare bones particle swarm optimization with distribution adaption

Bare bones PSO is a simple swarm optimization approach that uses a probability distribution like Gaussian distribution in the position update rules. However, due to its nature, Bare bones PSO is highly prone to premature convergence and stagnation. The characteristics of the probability distribution functions used in the update rule have a tense impact on the performance of the bare bones PSO. ...

Banach Algebras – Bare Bones Basics